ON POWERS AND CENTERS OF CHORDAL GRAPHSLASKAR R; SHIER D.1983; DISCRETE APPLIED MATHEMATICS; ISSN 0166-218X; NLD; DA. 1983; VOL. 6; NO 2; PP. 139-147; BIBL. 13 REF.Article

REGULARIZATION OF THE POWER OF A GRAPHSEKANINA M; VETCHY V.1980; ACTA MATH. UNIV. COMEN.; CSK; DA. 1980; VOL. 39; PP. 61-66; ABS. CZE/RUS; BIBL. 2 REF.Article

POWERS OF GRAPHS, LINE GRAPHS, AND TOTAL GRAPHS.HOBBS AM.1978; LECTURE NOTES MATH.; GERM.; DA. 1978; NO 642; PP. 271-285; BIBL. 1 P.; (THEORY APPL. GRAPHS. INT. CONF. PROC.; KALAMAZOO; 1976)Conference Paper

EINE CHARAKTERISIERUNG DER GRAPHEN DEREN DRITTE POTENZ 2-HAMILTONSCH IST. = UNE CARACTERISATION DU GRAPHE DONT LA PUISSANCE 3 EST 2 HAMILTONIENNESCHAAR G.1975; MATH. NACHR.; DTSCH.; DA. 1975; VOL. 66; PP. 145-154; BIBL. 4 REF.Article

COMPARAISON DES PUISSANCES DE GRAPHESBERMOND JC; MARCZYK A.1979; C.R. ACAD. SCI., A; FRA; DA. 1979; VOL. 288; NO 1; PP. 13-15; ABS. ENG; BIBL. 3 REF.Article

Hamiltonian results in K_1,3-free graphsMATTHEWS, M. M; SUMNER, D. P.Journal of graph theory. 1984, Vol 8, Num 1, pp 139-146, issn 0364-9024Article

Forbidden subgraphs and Hamiltonian properties in the square of a connected graphGOULD, R. J; JACOBSON, M. S.Journal of graph theory. 1984, Vol 8, Num 1, pp 147-154, issn 0364-9024Article

Powers of HHD-free graphsDRAGAN, F. F; NICOLAI, F; BRANDSTÄDT, A et al.International journal of computer mathematics. 1998, Vol 69, Num 3-4, pp 217-242, issn 0020-7160Article

On graph powers for leaf-labeled treesNISHIMURA, Naomi; RAGDE, Prabhakar; THILIKOS, Dimitrios M et al.Journal of algorithms (Print). 2002, Vol 42, Num 1, pp 69-108, issn 0196-6774Article

Computing bounded-degree phylogenetic roots of disconnected graphsCHEN, Zhi-Zhong; TSUKIJI, Tatsuie.Journal of algorithms (Print). 2006, Vol 59, Num 2, pp 125-148, issn 0196-6774, 24 p.Article

Powers of geometric intersection graphs and dispersion algorithmsAGNARSSON, Geir; DAMASCHKE, Peter; HALLDORSSON, Magnus M et al.Discrete applied mathematics. 2003, Vol 132, Num 1-3, pp 3-16, issn 0166-218X, 14 p.Article

The complexity of Boolean matrix root computationKUTZ, Martin.Theoretical computer science. 2004, Vol 325, Num 3, pp 373-390, issn 0304-3975, 18 p.Conference Paper